Reconstruction of compressed video via non-convex minimization
نویسندگان
چکیده
منابع مشابه
Iterative $\ell_1$ minimization for non-convex compressed sensing
An algorithmic framework, based on the difference of convex functions algorithm, is proposed for minimizing a class of concave sparse metrics for compressed sensing problems. The resulting algorithm iterates a sequence of l1 minimization problems. An exact sparse recovery theory is established to show that the proposed framework always improves on the basis pursuit (l1 minimization) and inherit...
متن کاملNon-Convex Rank Minimization via an Empirical Bayesian Approach
In many applications that require matrix solutions of minimal rank, the underlying cost function is non-convex leading to an intractable, NP-hard optimization problem. Consequently, the convex nuclear norm is frequently used as a surrogate penalty term for matrix rank. The problem is that in many practical scenarios there is no longer any guarantee that we can correctly estimate generative low-...
متن کاملSurface Reconstruction via L1-Minimization
A surface reconstruction technique based on the Lminimization of the variation of the gradient is introduced. This leads to a non-smooth convex programming problem. Well-posedness and convergence of the method is established and an interior point based algorithm is introduced. The L-surface reconstruction algorithm is illustrated on various test cases including natural and urban terrain data.
متن کاملDecoding of framewise compressed-sensed video via interframe total variation minimization
Compressed sensing is the theory and practice of subNyquist sampling of sparse signals of interest. Perfect reconstruction may then be possible with significantly fewer than the Nyquist required number of data. In this work, we consider a video system where acquisition is performed via framewise pure compressed sensing. The burden of quality video sequence reconstruction falls, then, solely on ...
متن کاملConvex risk minimization via proximal splitting methods
In this paper we investigate the applicability of a recently introduced primal-dual splitting method in the context of solving portfolio optimization problems which assume the minimization of risk measures associated to different convex utility functions. We show that, due to the splitting characteristic of the used primal-dual method, the main effort in implementing it constitutes in the calcu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: AIP Advances
سال: 2020
ISSN: 2158-3226
DOI: 10.1063/5.0022860